On an adjacency property of almost all graphs
نویسندگان
چکیده
منابع مشابه
On an adjacency property of almost all graphs
A graph is called n-existentially closed or n-e.c. if it satis/es the following adjacency property: for every n-element subset S of the vertices, and for every subset T of S, there is a vertex not in S which is joined to all of T and to none of S\T . The unique countable random graph is known to be n-e.c. for all n. Equivalently, for any /xed n, almost all /nite graphs are n-e.c. However, few e...
متن کاملOn an adjacency property of almost all tournaments
Let n be a positive integer. A tournament is called nexistentially closed (or n-e.c.) if for every subset S of n vertices and for every subset T of S, there is a vertex x / ∈ S which is directed toward every vertex in T and directed away from every vertex in S\T. We prove that there is a 2-e.c. tournament with k vertices if and only if k ≥ 7 and k 6= 8, and give explicit examples for all such o...
متن کاملThe structure of almost all graphs in a hereditary property
A hereditary property of graphs is a collection of graphs which is closed under taking induced subgraphs. The speed of P is the function n 7→ |Pn|, where Pn denotes the graphs of order n in P . It was shown by Alekseev, and by Bollobás and Thomason, that if P is a hereditary property of graphs then |Pn| = 2 2/2, where r = r(P) ∈ N is the so-called ‘colouring number’ of P . However, their result...
متن کاملAlmost all H-free graphs have the Erdős-Hajnal property
Erdős and Hajnal conjectured that, for every graph H, there exists a constant (H) > 0 such that every H-free graph G (that is, not containing H as an induced subgraph) must contain a clique or an independent set of size at least |G| . We prove that there exists (H) such that almost every H-free graph G has this property, meaning that, amongst the H-free graphs with n vertices, the proportion ha...
متن کاملGraphs with a prescribed adjacency property
A graph G is said to have property P(m,n,k) if for any set of m + n distinct vertices of G there are at least k other vertices, each of which is adjacent to the first m vertices of the set but not adjacent to any of the latter n vertices. The problem that arises is that of characterizing graphs having property P(m,n,k). In this paper, we present properties of graphs satisfying the adjacency pro...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Mathematics
سال: 2001
ISSN: 0012-365X
DOI: 10.1016/s0012-365x(00)00309-5